On Local Fixing
نویسندگان
چکیده
In this paper we look at the difficulty of fixing solutions of classic network problems. We study local changes in graphs (edge resp. node insertion resp. deletion), and network problems (e.g. maximal independent set, minimum vertex cover, spanning trees, shortest paths). A change/problem combination is locally fixable if an existing solution of a problem can be fixed in constant time in case of a local change in the graph. We analyze a variety of well-studied classic network problems with different characteristics.
منابع مشابه
ar X iv : h ep - l at / 0 20 20 10 v 1 7 F eb 2 00 2 1 ADP - 02 - 65 / T 505 QCD , Gauge Fixing , and the Gribov Problem
The standard techniques of gauge-fixing, such as covariant gauge fixing, are entirely adequate for the purposes of studies of perturbative QCD. However, they fail in the nonperturbative regime due to the presence of Gribov copies. These copies arise because standard local gauge fixing methods do not completely fix the gauge. Known Gribov-copy-free gauges, such as Laplacian gauge, are manifestly...
متن کاملEffect of Bio-Fertilizers Containing Nitrogen and Phosphorus Fixing Bacteria on Yield and Yield Components of Faba Bean
This study set out to investigate the effect of bio-fertilizers containing nitrogen-fixing bacteria and phosphorus on grain yield and yield components of Faba bean. To this end a factorial experiment on the basis of randomized complete block design with four replications was conducted in Behbahan region at South eastern part of Khuzestan Province of Iran. The experimental treatments included Ni...
متن کاملOn the fixed number of graphs
A set of vertices $S$ of a graph $G$ is called a fixing set of $G$, if only the trivial automorphism of $G$ fixes every vertex in $S$. The fixing number of a graph is the smallest cardinality of a fixing set. The fixed number of a graph $G$ is the minimum $k$, such that every $k$-set of vertices of $G$ is a fixing set of $G$. A graph $G$ is called a $k$-fixed graph, if its fix...
متن کاملON ABSOLUTE CENTRAL AUTOMORPHISMS FIXING THE CENTER ELEMENTWISE
Let G be a finite p-group and let Aut_l(G) be the group of absolute central automorphisms of G. In this paper we give necessary and sufficient condition on G such that each absolute central automorphism of G fixes the centre element-wise. Also we classify all groups of orders p^3 and p^4 whose absolute central automorphisms fix the centre element-wise.
متن کاملSoft Variable Fixing in Path Relinking: An Application to ACO Codes
Soft variable fixing has emerged as one of the main techniques that the area of matheuristics can contribute to general metaheuristics. Recent years have in fact witnessed a fruitful interplay of methods that were originally proposed as general metaheuristcs with methods rooted in mathematic programming, which can be applied alone or as hybrids for solving combinatorial optimization problems. I...
متن کاملLagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design
We present a branch-and-bound approach for the Capacitated Network Design Problem. We focus on tightening strategies such as variable fixing and local cuts that can be applied in every search node. Different variable fixing algorithms based on Lagrangian relaxations are evaluated solitarily and in combined versions. Moreover, we develop cardinality cuts for the problem and evaluate their useful...
متن کامل